An improved degree based condition for Hamiltonian cycles
نویسندگان
چکیده
A Hamiltonian cycle is a closed path through all the vertices of a graph. Since discovering whether a graph has a Hamiltonian path or a Hamiltonian cycle are both NP-complete problems, researchers concentrated on formulating sufficient conditions that ensure Hamiltonicity of a graph. A Information Processing Letters 94(2005), 37-51] presents distance based sufficient conditions for the existence of a Hamiltonian path. In this paper we establish that the same condition forces Hamiltonian cycle to be present excepting for the case where end points of a Hamiltonian path is at a distance greater than 2.
منابع مشابه
An Improved Lower Bound on the Number of Limit Cycles Bifurcating from a Hamiltonian Planar Vector Field of Degree 7
The limit cycle bifurcations of a Z2 equivariant planar Hamiltonian vector field of degree 7 under Z2 equivariant degree 7 perturbation is studied. We prove that the given system can have at least 53 limit cycles. This is an improved lower bound for the weak formulation of Hilbert’s 16th problem for degree 7, i.e., on the possible number of limit cycles that can bifurcate from a degree 7 planar...
متن کاملMinimum Vertex Degree Condition for Tight Hamiltonian Cycles in 3-uniform Hypergraphs
We show that every 3-uniform hypergraph with n vertices and minimum vertex degree at least p5{9` op1qq ` n 2 ̆ contains a tight Hamiltonian cycle. Known lower bound constructions show that this degree condition is asymptotically optimal. §
متن کاملOn Extremal Hypergraphs for Hamiltonian Cycles
We study su cient conditions for Hamiltonian cycles in hypergraphs, and obtain both Turánand Dirac-type results. While the Turán-type result gives an exact threshold for the appearance of a Hamiltonian cycle in a hypergraph depending only on the extremal number of a certain path, the Dirac-type result yields a su cient condition relying solely on the minimum vertex degree.
متن کاملA degree sum condition for graphs to be covered by two cycles
Let G be a k-connected graph of order n. In [1], Bondy considered a degree sum condition for a graph to have a hamiltonian cycle, say, to be covered by one cycle. He proved that if σk+1(G) > (k+1)(n− 1)/2, then G has a hamiltonian cycle. On the other hand, concerning a degree sum condition for a graph to be covered by two cycles, Enomoto et al. [4] proved that if k = 1 and σ3(G) ≥ n, then G can...
متن کاملA Hamiltonian Decomposition of 5-star
Star graphs are Cayley graphs of symmetric groups of permutations, with transpositions as the generating sets. A star graph is a preferred interconnection network topology to a hypercube for its ability to connect a greater number of nodes with lower degree. However, an attractive property of the hypercube is that it has a Hamiltonian decomposition, i.e. its edges can be partitioned into disjoi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 102 شماره
صفحات -
تاریخ انتشار 2007